翻訳と辞書 |
Seinosuke Toda : ウィキペディア英語版 | Seinosuke Toda is a computer scientist working at the Nihon University in Tokyo.〔(S. Toda ) at the Nihon University.〕 Toda earned his Ph.D. from the Tokyo Institute of Technology in 1992, under the supervision of Kojiro Kobayashi. He was a recipient of the 1998 Gödel Prize for proving Toda's theorem in computational complexity theory, which states that every problem in the polynomial hierarchy has a polynomial-time Turing reduction to a counting problem.〔(【引用サイトリンク】title=1998 Gödel Prize )〕 ==Notes==
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Seinosuke Toda」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|